A Modal View on Resource-Bounded Propositional Logics

Abstract Classical propositional logic plays a prominent role in industrial applications, and yet the complexity of this is presumed to be non-feasible. Tractable systems such as depth-bounded boolean logics approximate classical can seen model for resource-bounded agents whose reasoning style nonetheless classical. In paper we first study hierarchy tractable that not defined by depth. Then extend it into modal where modalities make explicit assumptions discharged proofs, thereby expressing blueprints proofs. A natural deduction system provided permits reason about manage proof blueprints.